Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
411	C HICAGO J OURNAL OF T HEORETICAL C OMPUTER S CIENCE 2013, Article 09, pages 1–6 http://cjtcs.cs.uchicago.edu/ Complexity of the homomorphism extension problem in the random case Alexandr Kazda∗ Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-07-24 06:23:43 Applied mathematics Mathematical optimization Graph theory Structure Homomorphism NP-complete Graph homomorphism FO Finitary relation Mathematics Complexity classes Morphisms
412	Unique Games on the Hypercube Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2015-02-07 14:10:22 NP-complete problems Combinatorial optimization Linear programming Operations research Real algebraic geometry Semidefinite programming Maximum cut Vertex cover Hypercube graph Theoretical computer science Graph theory Mathematics
413	1991: The Steiner Tree Problem: The Steiner Tree Problem Add to Reading List Source URL: www.comap.com Language: English - Date: 2014-07-31 15:13:23 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Euclidean geometry Distance Operations research Rectilinear Steiner tree Graph theory Theoretical computer science Mathematics
414	ARC MINIMIZATION IN FINITE STATE DECODING GRAPHS WITH CROSS-WORD ACOUSTIC CONTEXT G. Zweig, G. Saon F. Yvon Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2002-08-23 18:15:24 Bipartite graph NP-complete problems Graph operations Bipartite dimension Power graph analysis Graph theory Graph Clique
415	Approximation Hardness of Graphic TSP on Cubic Graphs Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-04-25 00:45:46 NP-complete problems Operations research Combinatorial optimization Travelling salesman problem Cubic graph Hamiltonian path Gadget Degree Regular graph Graph theory Theoretical computer science Mathematics
416	Theory of Computing Systems manuscript No. (will be inserted by the editor) Constant Thresholds Can Make Target Set Selection Tractable Morgan Chopin∗ · Andr´ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-09-10 04:14:52 Graph operations Path decomposition Vertex cover Feedback vertex set Clique Kernelization Dominating set Tree decomposition Vertex Graph theory Theoretical computer science NP-complete problems
417	Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗ Add to Reading List Source URL: www.ii.uib.no Language: English - Date: 2013-10-25 09:59:52 Chordal graph Clique Maximal independent set Split graph Tree decomposition Cograph Independent set Neighbourhood Clique-sum Graph theory Graph operations NP-complete problems
418	New Races in Parameterized Algorithmics Christian Komusiewicz and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany {christian.komusiewicz,rolf.niedermeier}@tu-berlin.de Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-08-07 06:26:48 NP-complete problems Parameterized complexity Kernelization Path decomposition Vertex cover Feedback vertex set Dominating set Tree decomposition Clique Graph theory Theoretical computer science Mathematics
419	Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:05:21 NP-complete problems Tree Clique Path decomposition Graph coloring Graph theory Theoretical computer science Mathematics
420	Fast Normalized Cut with Linear Constraints Linli Xu Wenye Li Dale Schuurmans Department of Computing Science University of Alberta Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2009-04-06 23:13:13 Matrix theory Mathematical optimization NP-complete problems Operations research Eigenvalues and eigenvectors Spectral clustering Graph partition Eigendecomposition of a matrix Segmentation Algebra Mathematics Linear algebra

UPDATE